Using simulated annealing for resource allocation

نویسندگان

  • Jeroen C. J. H. Aerts
  • Gerard B. M. Heuvelink
چکیده

Many resource allocation issues, such as land useor irrigation planning, require input from extensive spatial databases and involve complex decisionmaking problems. Spatial decision support systems (SDSS) are designed to make these issues more transparent and to support the design and evaluationof resource allocation alternatives. Recent developments in this Ž eld focus on the design of allocation plans that utilise mathematical optimisation techniques. These techniques, often referred to as multi-criteria decision-making (MCDM) techniques, run into numerical problemswhen faced with the high dimensionality encountered in spatial applications. In this paper we demonstrate how simulated annealing, a heuristic algorithm, can be used to solve high-dimensionalnon-linear optimisation problems for multi-site land use allocation (MLUA) problems. The optimisation model both minimises development costs and maximises spatial compactness of the land use. Compactness is achieved by adding a non-linear neighbourhood objective to the objective function. The method is successfully applied to a case study in Galicia, Spain, using an SDSS for supporting the restoration of a former mining area with new land use.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy

This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

متن کامل

Cell-based genetic algorithm and simulated annealing for spatial groundwater allocation

A genetic algorithm and a simulated annealing approach is presented for the guidance of a cellular automaton toward optimal configurations. The algorithm is applied to a problem of groundwater allocation in a rectangular area consisting of adjacent land blocks and modeled as a cellular automaton. The new algorithm is compared to a more conventional genetic algorithm and its efficiency is clearl...

متن کامل

Using Genetic Algorithms To Solve The Yard Allocation Problem

The Yard Allocation Problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). We first show that YAP is NP-Hard. As the problem is NP-Hard, we propose a Genetic Algorithm approach. For benchmarking purposes, Tabu Search and Simulated Annealing are applied to this problem as well. Extensive experiments show very favorable results for the Genetic Alg...

متن کامل

Scheduling Data Flow Programs in HardReal - Time

Data Flow is a natural paradigm representing distributed programs able to express data and control dependencies between composing nodes. Our work concentrates on periodic Data-Flow programs having Hard Real-Time constraints. We propose a model and a string-based representation for a relevant class of Data-Flow programs and present a two-phase algorithm able to compute a schedule for a given set...

متن کامل

A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)

Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Geographical Information Science

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2002